Testing Linear-Invariant Properties
نویسندگان
چکیده
Fix a prime $p$ and positive integer $R$. We study the property testing of functions $\mathbb F_p^n\to[R]$. say that is testable if there exists an oblivious tester for this with one-sided error constant query complexity. Furthermore, proximity oblivious-testable (PO-testable) test also independent parameter $\epsilon$. It known number natural properties such as linearity being low degree polynomial are PO-testable. These examples linear-invariant properties, meaning they preserved under linear automorphisms domain. Following work Kaufman Sudan, has been important problem in arithmetic testing. A central conjecture field, proposed by Bhattacharyya, Grigorescu, Shapira, only it semi subspace-hereditary. prove two results, first resolves second classifies PO-testable properties. (1) (2) locally characterized. Our innovations two-fold. give more powerful version compactness argument introduced Alon Shapira. This relies on new strong regularity lemma which one mixes different levels Gowers uniformity. allows us to extend Fischer, Hatami, Lovett removing bounded complexity restriction their work. innovation novel recoloring technique called patching. Ramsey-theoretic critical working setting remove translation-invariant present previous
منابع مشابه
Testing Linear-Invariant Non-Linear Properties
We consider the task of testing properties of Boolean functions that are invariant under linear transformations of the Boolean cube. Previous work in property testing, including the linearity test and the test for Reed-Muller codes, has mostly focused on such tasks for linear properties. The one exception is a test due to Green for “triangle freeness”: a function f : {0, 1}n → {0, 1} satisfies ...
متن کاملTesting Linear-Invariant Non-linear Properties: A Short Report
The rich collection of successes in property testing raises a natural question: Why are so many different properties turning out to be locally testable? Are there some broad “features” of properties that make them testable? Kaufman and Sudan (STOC 2008) proposed the study of the relationship between the invariances satisfied by a property and its testability. Particularly, they studied properti...
متن کاملTesting Linear-Invariant Function Isomorphism
A function f : F2 → {−1, 1} is called linear-isomorphic to g if f = g ◦ A for some non-singular matrix A. In the g-isomorphism problem, we want a randomized algorithm that distinguishes whether an input function f is linear-isomorphic to g or far from being so. We show that the query complexity to test g-isomorphism is essentially determined by the spectral norm of g. That is, if g is close to ...
متن کاملTesting Low Complexity Affine-Invariant Properties
Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of multivariate functions over finite fields is testable with a constant number of queries. This immediately reproves, for instance, that the Reed-Muller code over Fp of d...
متن کاملTesting Properties of Linear Functions
The function f : F2 → F2 is k-linear if it returns the sum (over F2) of exactly k coordinates of its input. We introduce strong lower bounds on the query complexity for testing whether a function is k-linear. We show that for any k ≤ n 2 , at least k−o(k) queries are required to test k-linearity, and we show that when k ≈ n 2 , this lower bound is nearly tight since 4 3 k+o(k) queries are suffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2022
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/21m1397246